A connected and regular point set which contains no arc
نویسندگان
چکیده
منابع مشابه
Concerning Connected and Regular Point Sets
In this paper an extension will be given of a theorem of the author'sf which states that if A and B are any two points of a continuous curve M, and K denotes the set of all those points of M which separate} A and B in M, then K+A+B is a closed set of points. I t will be shown that if A and B are any two points of any connected and regular (connected im kleinen) point set M, and K denotes the se...
متن کاملTranslating a regular grid over a point set
We consider the problem of translating a (finite or infinite) square grid G over a set S of n points in the plane in order to maximize some objective function. We say that a grid cell is k-occupied if it contains k or more points of S. The main set of problems we study have to do with translating an infinite grid so that the number of k-occupied cells is maximized or minimized. For these proble...
متن کاملDetecting all regular polygons in a point set
In this paper, we analyze the time complexity of nding regular polygons in a set of n points. We combine two di erent approaches to nd regular polygons, depending on their number of edges. Our result depends on the parameter α, which has been used to bound the maximum number of isosceles triangles that can be formed by n points. This bound has been expressed as O(n ), and the current best value...
متن کاملAutomatic G1 arc spline interpolation for closed point set
A method for generating an interpolation closed G arc spline on a given closed point set is presented. For the odd case, i.e. when the number of the given points is odd, this paper disproves the traditional opinion that there is only one closed G arc spline interpolating the given points. In fact, the number of the resultant closed G arc splines fulfilling the interpolation condition for the od...
متن کاملA 2-factor in which each cycle contains a vertex in a specified stable set
Let G be a graph with order n, and let k be an integer with 1 ≤ k ≤ n/3. In this article, we show that if σ2(G) ≥ n+ k− 1, then for any stable set S ⊆ V (G) with |S| = k, there exists a 2-factor with precisely k cycles C1, . . . , Ck such that |V (Ci) ∩ S| = 1 for all 1 ≤ i ≤ k and at most one of the cycles Ci has length strictly greater than three. The lower bound on σ2 is best possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1926
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1926-04210-5